Q&A: Brian Kobilka

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Profile of Brian K. Kobilka and Robert J. Lefkowitz, 2012 Nobel laureates in chemistry.

Those of us that had been hammering away in the field for 40 years or more cannot deny the excitement in learning that Brian Kobilka, a former postdoctoral fellow of Robert Lefkowitz, in collaboration with Roger Sunahara, had determined the structure of the agonist-bound β2-adrenergic receptor-Gs protein complex (1). To borrow a phrase from Henry Bourne, this is “the Big Enchilada” for the G pr...

متن کامل

Qa@l2f@qa@clef

This paper introduces L2F’s (INESC-ID) question/answering system and presents its results in the QA@CLEF07 evaluation task. QA@LF bases its performance on a high-quality deep linguistic analysis of the question, which is strongly based on named entity recognition. However, if a precise analysis is not possible or if no answer is found in previous processed data, the system is also capable of re...

متن کامل

Polarizations Brian

If A is an abelian variety over a field, then to give a projective embedding of A is more or less to give an ample line bundle on A. Over C, such data can be expressed in terms of a positive-definite Riemann form on the homology lattice. Hence, we consider ample line bundles on general abelian varieties to be a “positivity” structure. In a sense that will be explained, just as we view abelian v...

متن کامل

2 Brian

In this paper the authors investigate infinite-dimensional representations L in blocks of the relative (parabolic) category OS for a complex simple Lie algebra, having the property that the cohomology of the nilradical with coefficients in L “looks like” the cohomology with coefficients in a finite-dimensional module, as in Kostant’s theorem. A complete classification of these “Kostant modules”...

متن کامل

QA@L2F, Second Steps at QA@CLEF

This paper describes the participation of QA@LF, the question-answering system from LF/INESC-ID, at the QA track of CLEF in 2008. Making intensive use of a Natural Language Processing chain (which includes, among others, a morphological analyzer, a disambiguation module, a multi-word recognizer, a chunker and a named entities recognizer), QA@LF is based on a three module approach to answer ques...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 2014

ISSN: 0028-0836,1476-4687

DOI: 10.1038/514s12a